Improved Parity-Declustered Layouts for Disk Arrays
نویسندگان
چکیده
منابع مشابه
Efficient data mappings for parity-declustered data layouts
The joint demands of high performance and fault tolerance in a large array of disks can be satisfied by a parity-declustered data layout – an arrangement of data and redundant information that allows the rapid reconstruction of lost data while the array continues to operate. A data layout is typically generated by partitioning the data units on the disks into stripes and choosing one or more un...
متن کاملCombining replication and parity approaches for fault-tolerant disk arrays
In this paper, we explore the method of combining the replication and parity approaches to tolerate multiple disk failures in a disk array. In addition to the conventional mirrored and chained declustering methods , a method based on the hybrid of mirrored-and-chained declustering is explored. A performance study that explores the eeect of combining replication and parity approaches is conducte...
متن کاملPermutation Development Data Layout (PDDL)
Declustered data organizations in disk arrays (RAIDs) achieve less-intrusive reconstruction of data after a disk failure. We present PDDL, a new data layout for declustered disk arrays. PDDL layouts exist for a large variety of disk array configurations with a distributed spare disk. PDDL declustered disk arrays have excellent run-time performance under light and heavy workloads. PDDL maximizes...
متن کاملEfficient parity placement schemes for tolerating up to two disk failures in disk arrays
In order to achieve high reliability in disk array systems, two new schemes using dual parity placement, called DH1 (diagonal±horizontal) and DH2 schemes, are presented. Both DH schemes can tolerate up to two disk failures by using two types of parity information placed in the diagonal and the horizontal directions, respectively, in a matrix of disk partitions. DH1 scheme can reduce the occurre...
متن کاملThe Performance of Parity Placements in Disk Arrays
Due to recent advances in CPU and memory system performance, I/O systems are increasingly limiting the performance of modern computer systems. Redundant Arrays of Inexpensive Disks (RAID) have been proposed by Patterson et al. [1] to meet the impending I/O crisis. RAIDs substitute many small inexpensive disks for a few large expensive disks to provide higher performance (both transfer rate and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0073